Mathematical Toolkit Autumn 2015 Lecture 12 : November 11 , 2015
نویسنده
چکیده
φ ≡ C1 ∧ · · · ∧ Cm , where each Ci is a clause of the form Ci = (li1 ∨ li2 ∨ li3) and each lij is in turn xij or its negation xij . We assume that each clause contains three distinct variables. In the problem Max 3-SAT, the goal is not necessarily to satisfy all the clauses, but rather find an assignment to the variables which satisfies as many clauses as possible. We show that for any formula φ with m clauses, one can find an assignment satisfying 7m/8 clauses.
منابع مشابه
Improved PISO algorithms for modeling density varying flow in conjugate fluid-porous domains
Article history: Received 11 June 2015 Received in revised form 6 November 2015 Accepted 12 November 2015 Available online 21 November 2015
متن کاملOn the use of matrix-free shift-invert strategies for global flow instability analysis
Article history: Received 12 May 2014 Received in revised form 31 October 2014 Accepted 11 November 2014 Available online 18 November 2014
متن کاملFormal model-driven engineering of critical information systems
Article history: Received 17 June 2013 Received in revised form 11 November 2014 Accepted 12 November 2014 Available online xxxx
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015